Speed-up of DNA melting algorithm with complete nearest neighbor properties
نویسندگان
چکیده
منابع مشابه
Speed-up of DNA melting algorithm with complete nearest neighbor properties.
We describe an optimized algorithm, which is faster and more accurate compared to previously described algorithms, for computing the statistical mechanics of denaturation of nucleic acid sequences according to the classical Poland-Scheraga type of model. Nearest neighbor thermodynamics has been included in a complete and general way, by rigorously treating nearest neighbor interactions, helix e...
متن کاملNearest Neighbor Search Algorithm
A fundamental activity common to image processing, pattern recognition, and clustering algorithm involves searching set of n , k-dimensional data for one which is nearest to a given target data with respect to distance function . Our goal is to find search algorithms with are full search equivalent -which is resulting match as a good as we could obtain if we were to search the set exhausting. 1...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملAn Algorithm for Predicting Recurrence of Breast Cancer Using Genetic Algorithm and Nearest Neighbor Algorithm
Introduction: Breast cancer is one of the most common types of cancer and the most common type of malignancy in women, which has been growing in recent years. Patients with this disease have a chance of recurrence. Many factors reduce or increase this probability. Data mining is one of the methods used to detect or anticipate cancers, and one of its most common uses is to predict the recurrence...
متن کاملAn Incremental Nearest Neighbor Algorithm with Queries
We consider the general problem of learning multi-category classification from labeled examples. We present experimental results for a nearest neighbor algorithm which actively selects samples from different pattern classes according to a querying rule instead of the a priori class probabilities. The amount of improvement of this query-based approach over the passive batch approach depends on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biopolymers
سال: 2003
ISSN: 0006-3525
DOI: 10.1002/bip.10495